Independent and Vertex Covering Number on Kronecker Product of Km,n
نویسنده
چکیده
Let α(G) and β(G) be the independent number and vertex covering number of G, respectively. The Kronecker Product G1 ⊗ G2 of graph of G1 and G2 has vertex set V (G1 ⊗ G2) = V (G1) × V (G2) and edge set E(G1 ⊗ G2) = {(u1v1)(u2v2)|u1u2 ∈ E(G1) and v1v2 ∈ E(G2)}. In this paper, let G is a simple graph with order p, we prove that, α(Km,n⊗G)= max {(m+n)α(G),p max{m,n}} and β(Km,n⊗G) =min {(m + n)β(G), p min{m,n}}.
منابع مشابه
Bounds on the outer-independent double Italian domination number
An outer-independent double Italian dominating function (OIDIDF)on a graph $G$ with vertex set $V(G)$ is a function$f:V(G)longrightarrow {0,1,2,3}$ such that if $f(v)in{0,1}$ for a vertex $vin V(G)$ then $sum_{uin N[v]}f(u)geq3$,and the set $ {uin V(G)|f(u)=0}$ is independent. The weight ofan OIDIDF $f$ is the value $w(f)=sum_{vin V(G)}f(v)$. Theminimum weight of an OIDIDF on a graph $G$ is cal...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملOn r-equitable chromatic threshold of Kronecker products of complete graphs
A graph G is r-equitably k-colorable if its vertex set can be partitioned into k independent sets, any two of which differ in size by at most r. The r-equitable chromatic threshold of a graph G, denoted by χr=(G), is the minimum k such that G is r-equitably k -colorable for all k ≥ k. Let G × H denote the Kronecker product of graphs G and H. In this paper, we completely determine the exact valu...
متن کامل